package leetcode.code6186;

public class Solution {

	public int[] smallestSubarrays(int[] nums) {
		int len = nums.length;
		int[] ans = new int[len];
		int max = 0, r = len;
		return null;
	}

}
